Strategies in P ρ Log
نویسندگان
چکیده
PρLog is an experimental extension of logic programming with strategic conditional transformation rules, combining Prolog with ρLog calculus. The rules perform nondeterministic transformations on hedges. Strategies provide a control on rule applications in a declarative way. In this short paper we give an overview on programming with strategies in PρLog and demonstrate how rewriting strategies can be expressed.
منابع مشابه
Supplementary document for the paper “ Real - Time Streaming of Gauss - Markov Sources over Sliding Window Burst - Erasure Channels ” submitted to ISIT 2013
First note that for any ρ ∈ (0, 1) and x ∈ R the function f (x) = x − 1 2 log ρ 2m 2 2x + 2πe(1 − ρ 2m) (1) is an monotonically increasing function with respect to x, because f ′ (x) = 2πe(1 − ρ 2m) ρ 2m 2 2x + 2πe(1 − ρ 2m) > 0. (2) By applying Shannon's EPI we have. h(s b |f a) ≥ 1 2 log ρ 2m 2 2h(sa|fa) + 2πe(1 − ρ 2m) (3) and thus, h(s a |f a) − h(s b |f a) ≤ h(s a |f a) − 1 2 log ρ 2m 2 2h...
متن کاملApproximation and Streaming Algorithms for Projective Clustering via Random Projections
Let P be a set of n points in R. In the projective clustering problem, given k, q and norm ρ ∈ [1,∞], we have to compute a set F of k q-dimensional flats such that ( ∑ p∈P d(p,F)) is minimized; here d(p,F) represents the (Euclidean) distance of p to the closest flat in F . We let f k (P, ρ) denote the minimal value and interpret f k (P,∞) to be maxr∈P d(r,F). When ρ = 1, 2 and ∞ and q = 0, the ...
متن کاملRandomized Strategies for Cardinality Robustness in the Knapsack Problem
We consider the following zero-sum game related to the knapsack problem. Given an instance of the knapsack problem, Alice chooses a knapsack solution and Bob chooses a cardinality k with knowing Alice’s solution. Then, Alice obtains a payoff equal to the ratio of the profit of the best k items in her solution to that of the best solution of size at most k. For α > 0, a knapsack solution is call...
متن کاملBeyond the Multiplexing Gain: The Throughput-Reliability Tradeoff∗
In this paper, an outage limited MIMO channel is considered. We build on Zheng and Tse’s elegant formulation of diversity-multiplexing tradeoff to develop a better understanding of the asymptotic relationship between probability of error, transmission rate and signal-to-noise ratio. We identify the limitation imposed by the notion of multiplexing gain and develop a new formulation for the throu...
متن کاملThe Local Dimensions of the Bernoulli Convolution Associated with the Golden Number
Let X1,X2, . . . be a sequence of i.i.d. random variables each taking values of 1 and −1 with equal probability. For 1/2 < ρ < 1 satisfying the equation 1 − ρ − · · · − ρs = 0, let μ be the probability measure induced by S = ∑∞ i=1 ρ Xi. For any x in the range of S, let d(μ, x) = lim r→0+ logμ([x− r, x + r])/ log r be the local dimension of μ at x whenever the limit exists. We prove that α∗ = −...
متن کامل